Garbage Collection for Trailer Arrays
نویسندگان
چکیده
Persistent data structures often use tricks to achieve their performance guarantees. In these structures, pointer reachability fails as a method of determining what is and isn’t garbage. We present an extension for a garbage collector which can understand and collect a particular persistent structure called trailer arrays. Our method does not increase the time or space complexity of garbage collection in most cases.
منابع مشابه
Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection
Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new lowlevel mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed ar...
متن کاملAn Age-Threshold Algorithm for Garbage Collection in Log-Structured Arrays and File Systems
In this paper, we propose and study a new algorithm for choosing segments for garbage collection in Log-Structured File Systems (LFS) and Log-Structured Arrays (LSA). We compare the performance of our new algorithm against previously known algorithms such as greedy and cost-beneet through simulation. The basic idea of our algorithm is that segments which have been recently lled by writes from t...
متن کاملImplementing Sets for Reversible Computation
Sets provide a very general tool for representing information and modelling the behaviour of systems. We consider their implementation and associated problems of garbage collection in the context of reversible computation. We describe our implementation technique, which uses ordered arrays, and discuss scalability of performance.
متن کاملAutomatic Removal of Array Memory Leaks in Java
Current garbage collection (GC) techniques do not (and in general cannot) collect all the garbage that a program produces. This may lead to a performance slowdown and to programs running out of memory space. In this paper, we present a practical algorithm for statically detecting memory leaks occurring in arrays of objects in a garbage collected environment. No previous algorithm exists. The al...
متن کاملA Quantitative Analysis of Space Waste from Java Strings and its Elimination at Garbage Collection Time
This paper describes a novel approach to reduce the memory consumption of Java programs, by reducing the string memory waste in the runtime. In recent Java applications, string data occupies a large amount of the heap area. For example, more than 30% of the live heap area is used for string data when WebSphere Application Server with Trade6 is running. By investigating the string data in real J...
متن کامل